Entangling gates for trapped-ion quantum computation and quantum simulation
نویسندگان
چکیده
The trapped-ion system has been a leading platform for practical quantum computation and simulation since the first scheme of gate was proposed by Cirac Zoller in 1995. Quantum gates with trapped ions have shown highest fidelity among all physical platforms. Recently, sophisticated schemes such as amplitude, phase, frequency modulation, or multi-frequency application, developed to make fast, robust many types imperfections, applicable multiple qubits. Here, we review basic principle recent development ions.
منابع مشابه
Scaling ion trap quantum computation through fast quantum gates.
We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through spin-dependent acceleration of the ions from periodic photon kicks. The gates are shown to be robust to influence all the other ions in the array and insensitive to t...
متن کاملTrapped-ion quantum logic gates based on oscillating magnetic fields.
Oscillating magnetic fields and field gradients can be used to implement single-qubit rotations and entangling multiqubit quantum gates for trapped-ion quantum information processing (QIP). With fields generated by currents in microfabricated surface-electrode traps, it should be possible to achieve gate speeds that are comparable to those of optically induced gates for realistic distances betw...
متن کاملElementary gates for quantum computation.
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y) to (x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...
متن کاملElementary Gates for Quantum Computation
(quant-ph/9503007) 36] R. Landauer, \Is quantum mechanics useful?", Proc. Roy. Soc. Lond., (to be published). 37] The only non-trivial one-bit classical invertible operation is 0 1 1 0. 41] Corresponding with the deenition in the previous section, the top two wires contain the input bits x 1 and x 2 , and the third wire contains the input y). 42] The angle-halving of this deenition conforms to ...
متن کاملEfficient quantum computation with probabilistic quantum gates.
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Physical Society
سال: 2023
ISSN: ['1976-8524', '0374-4884']
DOI: https://doi.org/10.1007/s40042-023-00772-3